Minimum Circuit Size, Graph Isomorphism, and Related Problems
نویسندگان
چکیده
منابع مشابه
Minimum Circuit Size, Graph Isomorphism, and Related Problems
We study the computational power of deciding whether a given truth-table can be described by a circuit of a given size (the Minimum Circuit Size Problem, or MCSP for short), and of the variant denoted as MKTP where circuit size is replaced by a polynomially-related Kolmogorov measure. All prior reductions from supposedly-intractable problems to MCSP / MKTP hinged on the power of MCSP / MKTP to ...
متن کاملGraph Isomorphism and Circuit Size
We show that the Graph Automorphism problem is ZPP-reducible to MKTP, the problem of minimizing time-bounded Kolmogorov complexity. MKTP has previously been studied in connection with the Minimum Circuit Size Problem (MCSP) and is often viewed as essentially a different encoding of MCSP. All prior reductions to MCSP have applied equally well to MKTP, and vice-versa, and all such reductions have...
متن کاملGraph Partition Problems with Minimum Size Constraints
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x
متن کاملReductions of Graph Isomorphism Problems
We present a reduction between subgraph isomorphism and minimal partial subgraph isomorphism. We also provide a new reduction between graph isomorphism and minimal partial graph isomorphism. The new reduction is more efficient and simpler than the previous reduction and can be generalized to subgraph isomorphism. In addition, we show that a reduction from graph isomorphism that makes only one c...
متن کاملOn spectral properties for graph matching and graph isomorphism problems
Problems related to graph matching and isomorphisms are very important both from a theoretical and practical perspective, with applications ranging from image and video analysis to biological and biomedical problems. The graph matching problem is challenging from a computational point of view, and therefore different relaxations are commonly used. Although common relaxations techniques tend to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2018
ISSN: 0097-5397,1095-7111
DOI: 10.1137/17m1157970